Comparative study of pheromone control heuristics in ACO algorithms for solving RCPSP problems

Comparative Study of Heuristics Algorithms in Solving Flexible Job Shop Scheduling Problem with Condition Based Maintenance

Purpose: This paper focuses on a classic optimization problem in operations research, the flexible job shop scheduling problem (FJSP), to discuss the method to deal with uncertainty in a manufacturing system. Design/methodology/approach: In this paper, condition based maintenance (CBM), a kind of preventive maintenance, is suggested to reduce unavailability of machines. Different to the simulta...

Estimation of LOS Rates for Target Tracking Problems using EKF and UKF Algorithms- a Comparative Study

One of the most important problem in target tracking is Line Of Sight (LOS) rate estimation for using from PN (proportional navigation) guidance law. This paper deals on estimation of position and LOS rates of target with respect to the pursuer from available noisy RF seeker and tracker measurements. Due to many important for exact estimation on tracking problems must target position and Line O...

study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour

this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

Solving Hop-constrained MST problems with ACO

The Hop-constrained Minimum cost Flow Spanning Tree (HMFST) problem is an extension of the Hop-Constrained Minimum Spanning Tree problem since it considers flow requirements other than unit flows. Given that we consider the total costs to be nonlinearly flow dependent with a fixed-charge component and given the combinatorial nature of this class of problems, we propose a heuristic approach to a...